computational complexity theory

Results: 2049



#Item
911Robust Regression on MapReduce  Xiangrui Meng LinkedIn Corporation, 2029 Stierlin Ct, Mountain View, CAMichael W. Mahoney Department of Mathematics, Stanford University, Stanford, CA 94305

Robust Regression on MapReduce Xiangrui Meng LinkedIn Corporation, 2029 Stierlin Ct, Mountain View, CAMichael W. Mahoney Department of Mathematics, Stanford University, Stanford, CA 94305

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2013-05-09 18:59:40
912CS355: Topics in cryptography  Fall 2002 Assignment 0.5: Warm-Up Questions

CS355: Topics in cryptography Fall 2002 Assignment 0.5: Warm-Up Questions

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2002-10-22 22:16:40
913CS161 Design and Analysis of Algorithms Dan Boneh 1

CS161 Design and Analysis of Algorithms Dan Boneh 1

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2001-04-08 18:20:48
914Part III  Michaelmas 2012 COMPUTATIONAL COMPLEXITY Lecture notes

Part III Michaelmas 2012 COMPUTATIONAL COMPLEXITY Lecture notes

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2013-10-08 12:14:22
915Analyzing Runtime and Size Complexity of Integer Programs (Abstract) Marc Brockschmidt1 , Fabian Emmes1 , Stephan Falke2 , Carsten Fuhs3 , and Jürgen Giesl1 1 2

Analyzing Runtime and Size Complexity of Integer Programs (Abstract) Marc Brockschmidt1 , Fabian Emmes1 , Stephan Falke2 , Carsten Fuhs3 , and Jürgen Giesl1 1 2

Add to Reading List

Source URL: www.imn.htwk-leipzig.de

Language: English - Date: 2013-08-26 10:13:12
916Adaptive Greedy Approximations1 Georey Davis Mathematics Department, Dartmouth College Hanover, NHStephane Mallat, Marco Avellaneda

Adaptive Greedy Approximations1 Geo rey Davis Mathematics Department, Dartmouth College Hanover, NHStephane Mallat, Marco Avellaneda

Add to Reading List

Source URL: www.geoffdavis.net

Language: English
917On the fundamental limitations of performance for [0.5ex] distributed decision-making in robotic networks

On the fundamental limitations of performance for [0.5ex] distributed decision-making in robotic networks

Add to Reading List

Source URL: aa.stanford.edu

Language: English - Date: 2014-04-28 17:46:50
918Motivation  COMS21103 NP-completeness

Motivation COMS21103 NP-completeness

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-01-08 09:09:08
919Approximate Counting and Markov Chain Monte Carlo A Randomized Approach Arindam Pal Department of Computer Science and Engineering Indian Institute of Technology Delhi

Approximate Counting and Markov Chain Monte Carlo A Randomized Approach Arindam Pal Department of Computer Science and Engineering Indian Institute of Technology Delhi

Add to Reading List

Source URL: www.cse.iitd.ernet.in

Language: English - Date: 2011-04-08 01:08:14
920Contents  Part I The Basics

Contents Part I The Basics

Add to Reading List

Source URL: www.thi.informatik.uni-frankfurt.de

Language: English - Date: 2012-03-10 09:16:28